Improved data structures for predecessor queries in integer sets
نویسنده
چکیده
We consider the problem of maintaining a dynamic ordered set of n integers in the range 0 : :2 w ?1, under the operations of insertion, deletion and predecessor queries, on a unit-cost RAM with a word length of w bits. We show that all the operations above can be performed in O(minflogw; 1 + logn= logwg) expected time, assuming the updates are oblivious, i.e., independent of the random choices made by the data structure. This improves upon the (deterministic) running time of O(minflog w; p logng) obtained by Fredman and Willard. We also give a very simple deterministic data structure which matches the bound of Fredman and Willard. Finally, from the randomized data structure we are able to derive improved deterministic data structures for the static version of this problem.
منابع مشابه
Predecessor Queries in Dynamic Integer Sets
We consider the problem of maintaining a set of n integers in the range 0::2 w ? 1 under the operations of insertion, deletion, predecessor queries, minimum queries and maximum queries on a unit cost RAM with word size w bits. Let f (n) be an arbitrary nondecreasing smooth function satisfying log log n f (n) p log n. A data structure is presented supporting insertions and deletions in worst cas...
متن کاملA Lower Bound on Supporting Predecessor Search in k sorted Arrays
We seek to perform efficient queries for the predecessor among n values stored in k sorted arrays. Evading the Ω(n log k) lower bound from merging k arrays, we support predecessor queries in O(logn) time after O(n log( k logn )) construction time. By applying Ben-Or’s technique, we establish that this is optimal for strict predecessor queries, i.e., every data structure supporting O(logn)-time ...
متن کاملOptimised Predecessor Data Structures for Internal Memory
We demonstrate the importance of reducing misses in the translation-lookaside bu er (TLB) for obtaining good performance on modern computer architectures. We focus on data structures for the dynamic predecessor problem: to maintain a set S of keys from a totally ordered universe under insertions, deletions and predecessor queries. We give two general techniques for simultaneously reducing cache...
متن کاملEstimating the Selectivity of Spatial Queries Using the 'Correlation' Fractal Dimension
We examine the estimation of selectivities for range and spatial join queries in real spatial databases. As we have shown earlier [FK94], real point sets: (a) violate consistently the “uniformity” and “independence” assumptions, (b) can often be described as “fractals”, with non-integer (fractal) dimension. In this paper we show that, among the infinite family of fractal dimensions, the so call...
متن کاملImproved Univariate Microaggregation for Integer Values
Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational priva...
متن کامل